Strongly regular and pseudo geometric graphs

نویسندگان

  • M. Mitjana
  • E. Bendito
  • Á. Carmona
  • A. M. Encinas
چکیده

Very often, strongly regular graphs appear associated with partial geometries. The point graph of a partial geometry is the graph whose vertices are the points of the geometry and adjacency is defined by collinearity. It is well known that the point graph associated to a partial geometry is a strongly regular graph and, in this case, the strongly regular graph is named geometric. When the parameters of a strongly regular graph, Γ, satisfy the relations of a geometric graph, then Γ is named a pseudo geometric graph. Moreover, it is known that not every pseudo geometric graph is geometric. In this work, we characterize strongly regular graphs that are pseudo geometric and we analyze when the complement of a pseudo geometric graph is also pseudo geometric.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Pseudo-geometric Graphs for Generalized Quadrangles of Order (3, t)

The values t = 1, 3, 5, 6, 9 satisfy the standard necessary conditions for existence of a generalised quadrangle of order (3, t). This gives the following possible parameter sets for strongly regular graphs that are pseudo-geometric for such a generalised quadrangle: (v, k, λ, μ) = (16, 6, 2, 2), (40, 12, 2, 4), (64, 18, 2, 6), (76, 31, 2, 7) and (112, 30, 2, 10). It is well-known that there ar...

متن کامل

Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs

A graph G is pseudo 2–factor isomorphic if the parity of the number of cycles in a 2–factor is the same for all 2–factors ofG. In [3] we proved that pseudo 2–factor isomorphic k–regular bipartite graphs exist only for k ≤ 3. In this paper we generalize this result for regular graphs which are not necessarily bipartite. We also introduce strongly pseudo 2–factor isomorphic graphs and we prove th...

متن کامل

CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

متن کامل

On graphs and codes associated to the sporadic simple groups HS and M22

We provide a new construction of the strongly regular graphs associated with the two sporadic simple groups M22 and HS. Further, we give some new constructions of other known strongly regular graphs by taking the orbits of a certain subgroup of M22 on the planes of the Hermitian variety H(5, 4). These geometric constructions can be used to produce cap codes with large parameters and automorphis...

متن کامل

un 2 00 8 Cores of Geometric Graphs Chris

Cameron and Kazanidis have recently shown that rank-3 graphs are either cores or have complete cores, and they asked whether this holds for all strongly regular graphs. We prove that this is true for the point graphs and line graphs of generalized quadrangles and that when the number of points is sufficiently large, it is also true for the block graphs of Steiner systems and orthogonal arrays.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011